package hotLeetcode;

public class H198Leetcode {
    public int rob(int[] nums) {
        if (nums.length == 0) return 0;
        if (nums.length == 1) return nums[0];

        int n = nums.length;
        int[] dp = new int[n];
        dp[0] = nums[0];
        dp[1] = Math.max(nums[0], nums[1]);

        for (int i = 2; i < n; i++) {
            dp[i] = Math.max(dp[i - 1], nums[i] + dp[i - 2]);

        }
        return dp[n - 1];

    }

    public static void main(String[] args) {
        int[] nums = {1,2,3,1};
        H198Leetcode h198Leetcode = new H198Leetcode();
        System.out.println(h198Leetcode.rob(nums));
    }
}
